<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.12"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>emp-toolkit: /Users/wangxiao/git/emp-toolkit/emp-tool/utils/xor_tree.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="logo-full-doxygen.png"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">emp-toolkit
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.12 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('xor__tree_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">xor_tree.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="xor__tree_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="preprocessor">#ifndef XORTREE_H__</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="preprocessor">#define XORTREE_H__</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="bit_8h.html">bit.h</a>&quot;</span></div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">//TODO: hardcoded with ssp=40, should at least support a range a ssp&#39;s</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="keyword">template</span>&lt;<span class="keywordtype">int</span> N=232, <span class="keywordtype">int</span> M=232&gt;</div><div class="line"><a name="l00010"></a><span class="lineno"><a class="line" href="class_xor_tree.html">   10</a></span>&#160;<span class="keyword">class </span><a class="code" href="class_xor_tree.html">XorTree</a>{<span class="keyword">public</span>:</div><div class="line"><a name="l00011"></a><span class="lineno"><a class="line" href="class_xor_tree.html#a9ca6435f85c74f86584bfd24f8e30866">   11</a></span>&#160;    <span class="keywordtype">int</span> <a class="code" href="class_xor_tree.html#adbec4bd5ec40bee293c71c69c50c3ebd">n</a>, <a class="code" href="class_xor_tree.html#a9ca6435f85c74f86584bfd24f8e30866">ssp</a>;</div><div class="line"><a name="l00012"></a><span class="lineno"><a class="line" href="class_xor_tree.html#af82684ce03b95a9243330850eddce0cf">   12</a></span>&#160;    <span class="keywordtype">bool</span> <a class="code" href="class_xor_tree.html#af82684ce03b95a9243330850eddce0cf">matrix</a>[N][M];</div><div class="line"><a name="l00013"></a><span class="lineno"><a class="line" href="class_xor_tree.html#a8e1a7b19f1313b55b3b2ebd63fe4a493">   13</a></span>&#160;    <a class="code" href="garble_2block_8h.html#a65abbf31b0a30290189cdb5059b5f785">block</a> <a class="code" href="class_xor_tree.html#a8e1a7b19f1313b55b3b2ebd63fe4a493">blockM</a>[N][M];</div><div class="line"><a name="l00014"></a><span class="lineno"><a class="line" href="class_xor_tree.html#af69211493a22429ccc38ca8dcbdcd9c4">   14</a></span>&#160;    <a class="code" href="class_xor_tree.html#af69211493a22429ccc38ca8dcbdcd9c4">XorTree</a>(<span class="keywordtype">int</span> n, <span class="keywordtype">int</span> ssp = 40) {</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;        this-&gt;n=<a class="code" href="class_xor_tree.html#adbec4bd5ec40bee293c71c69c50c3ebd">n</a>;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;        this-&gt;ssp = <a class="code" href="class_xor_tree.html#a9ca6435f85c74f86584bfd24f8e30866">ssp</a>;</div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;        uint8_t bM[N][M];</div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;        <a class="code" href="class_p_r_g.html">PRG</a> prg(<a class="code" href="utils_2block_8h.html#a1a61c940fcdfab9d717ed2f9c27f3602">fix_key</a>);</div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;        prg.<a class="code" href="class_p_r_g.html#a3b64a0c91c31cec853c1829953409520">random_data</a>(bM, N*M);</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; N; ++i)</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;            <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = 0; j &lt; M; ++j) {</div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;                matrix[i][j] = (bM[i][j]%2 == 1);</div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;                blockM[i][j] = matrix[i][j] ? <a class="code" href="utils_2block_8h.html#a82cb0a8d42708a807a061856813ac9f6">one_block</a>(): <a class="code" href="utils_2block_8h.html#af2ad8a9f0015464df6574a13e598bdb8">zero_block</a>();</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;            }</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    }</div><div class="line"><a name="l00026"></a><span class="lineno"><a class="line" href="class_xor_tree.html#a406396309c9b8f76b5706225aba1ae35">   26</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_xor_tree.html#a406396309c9b8f76b5706225aba1ae35">circuitN</a>(<a class="code" href="garble_2block_8h.html#a65abbf31b0a30290189cdb5059b5f785">block</a>* out, <a class="code" href="garble_2block_8h.html#a65abbf31b0a30290189cdb5059b5f785">block</a> * in, <span class="keywordtype">int</span> dim = N) {</div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;        assert(dim &lt;= N);</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;    </div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; dim; ++i) {</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;            <a class="code" href="garble_2block_8h.html#a65abbf31b0a30290189cdb5059b5f785">block</a> res = <a class="code" href="utils_2block_8h.html#af2ad8a9f0015464df6574a13e598bdb8">zero_block</a>();</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;            <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = 0; j &lt; M; ++j) {</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;                res = <a class="code" href="utils_2block_8h.html#a939b7dd0e7479964d6fe6984b90dd5ce">xorBlocks</a>(res, <a class="code" href="utils_2block_8h.html#a26f0bc3cdba6ad8ab7e14bb989f74205">andBlocks</a>(in[j], blockM[i][j]));</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;            }</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;            out[i] = <a class="code" href="utils_2block_8h.html#a939b7dd0e7479964d6fe6984b90dd5ce">xorBlocks</a>(res, in[i+M]);</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        }</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    }</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;</div><div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="class_xor_tree.html#a3f669624bfe400630850716046096cfc">   38</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_xor_tree.html#a3f669624bfe400630850716046096cfc">circuit</a>(<a class="code" href="garble_2block_8h.html#a65abbf31b0a30290189cdb5059b5f785">block</a> * out, <a class="code" href="garble_2block_8h.html#a65abbf31b0a30290189cdb5059b5f785">block</a> * in) {</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        <span class="keywordtype">int</span> i ;</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <span class="keywordflow">for</span>(i = 0; i &lt; n/N; ++i) {</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;            <a class="code" href="class_xor_tree.html#a406396309c9b8f76b5706225aba1ae35">circuitN</a>(out+(i*N), in+(N+M)*i, N);</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        }</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        <span class="keywordflow">if</span>(n%N != 0) {</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;            <a class="code" href="class_xor_tree.html#a406396309c9b8f76b5706225aba1ae35">circuitN</a>(out+(i*N) , in+(N+M)*i, n%N);</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;        }</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    }</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;</div><div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="class_xor_tree.html#ac5b747f402fc2e8bae9498879871c295">   48</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_xor_tree.html#ac5b747f402fc2e8bae9498879871c295">genN</a>(<span class="keywordtype">bool</span>* out, <span class="keywordtype">bool</span> * in, <a class="code" href="class_p_r_g.html">PRG</a> * prg, <span class="keywordtype">int</span> dim = N) {</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        assert(dim &lt;= N);</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        uint8_t tmp[M];</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        prg-&gt;<a class="code" href="class_p_r_g.html#a3b64a0c91c31cec853c1829953409520">random_data</a>(tmp, M);</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; M; ++i)</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;            out[i] = (tmp[i]%2==1);</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;    </div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; dim; ++i) {</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;            <span class="keywordtype">bool</span> res = <span class="keyword">false</span>;</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;            <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = 0; j &lt; M; ++j) {</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;                <span class="keywordflow">if</span>( matrix[i][j] == 1)</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;                    res = res ^ (out[j]);</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            }</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;            out[M+i] = res ^ in[i];</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        }</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;    }</div><div class="line"><a name="l00064"></a><span class="lineno"><a class="line" href="class_xor_tree.html#a09bb4de1c5f3eab9134248695cd90941">   64</a></span>&#160;    <span class="keywordtype">int</span> <a class="code" href="class_xor_tree.html#a09bb4de1c5f3eab9134248695cd90941">output_size</a>() {</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        <span class="keywordflow">if</span>(n%N == 0)</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            <span class="keywordflow">return</span> (M+N)*n/N;</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">return</span> (M+N)*(n/N+1);</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;    }</div><div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="class_xor_tree.html#a4a5f515b56302a2898a81dedf9e1e2cc">   69</a></span>&#160;    <span class="keywordtype">int</span> <a class="code" href="class_xor_tree.html#a4a5f515b56302a2898a81dedf9e1e2cc">input_size</a>() {</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="class_xor_tree.html#adbec4bd5ec40bee293c71c69c50c3ebd">n</a>;</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    }</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;</div><div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="class_xor_tree.html#ae93134171f86f8610b48ab8eed01fa35">   73</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_xor_tree.html#ae93134171f86f8610b48ab8eed01fa35">gen</a>(<span class="keywordtype">bool</span> * out, <span class="keywordtype">bool</span> * in) {</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;        <a class="code" href="class_p_r_g.html">PRG</a> prg;<span class="keywordtype">int</span> i;</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        <span class="keywordflow">for</span>(i = 0; i &lt; n/N; ++i) {</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;            <a class="code" href="class_xor_tree.html#ac5b747f402fc2e8bae9498879871c295">genN</a>(out+(i*(N+M)), in+N*i, &amp;prg, N);</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;        }</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;        <span class="keywordflow">if</span>(n%N != 0) {</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;            <a class="code" href="class_xor_tree.html#ac5b747f402fc2e8bae9498879871c295">genN</a>(out+(i*(N+M)) , in+N*i, &amp;prg, n%N);</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        }</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    }</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;};</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;</div><div class="ttc" id="class_xor_tree_html_a8e1a7b19f1313b55b3b2ebd63fe4a493"><div class="ttname"><a href="class_xor_tree.html#a8e1a7b19f1313b55b3b2ebd63fe4a493">XorTree::blockM</a></div><div class="ttdeci">block blockM[N][M]</div><div class="ttdef"><b>Definition:</b> xor_tree.h:13</div></div>
<div class="ttc" id="class_xor_tree_html_ac5b747f402fc2e8bae9498879871c295"><div class="ttname"><a href="class_xor_tree.html#ac5b747f402fc2e8bae9498879871c295">XorTree::genN</a></div><div class="ttdeci">void genN(bool *out, bool *in, PRG *prg, int dim=N)</div><div class="ttdef"><b>Definition:</b> xor_tree.h:48</div></div>
<div class="ttc" id="garble_2block_8h_html_a65abbf31b0a30290189cdb5059b5f785"><div class="ttname"><a href="garble_2block_8h.html#a65abbf31b0a30290189cdb5059b5f785">block</a></div><div class="ttdeci">__m128i block</div><div class="ttdef"><b>Definition:</b> block.h:8</div></div>
<div class="ttc" id="class_xor_tree_html_a4a5f515b56302a2898a81dedf9e1e2cc"><div class="ttname"><a href="class_xor_tree.html#a4a5f515b56302a2898a81dedf9e1e2cc">XorTree::input_size</a></div><div class="ttdeci">int input_size()</div><div class="ttdef"><b>Definition:</b> xor_tree.h:69</div></div>
<div class="ttc" id="class_xor_tree_html_af82684ce03b95a9243330850eddce0cf"><div class="ttname"><a href="class_xor_tree.html#af82684ce03b95a9243330850eddce0cf">XorTree::matrix</a></div><div class="ttdeci">bool matrix[N][M]</div><div class="ttdef"><b>Definition:</b> xor_tree.h:12</div></div>
<div class="ttc" id="utils_2block_8h_html_a939b7dd0e7479964d6fe6984b90dd5ce"><div class="ttname"><a href="utils_2block_8h.html#a939b7dd0e7479964d6fe6984b90dd5ce">xorBlocks</a></div><div class="ttdeci">block xorBlocks(block x, block y)</div><div class="ttdef"><b>Definition:</b> block.h:35</div></div>
<div class="ttc" id="class_xor_tree_html_af69211493a22429ccc38ca8dcbdcd9c4"><div class="ttname"><a href="class_xor_tree.html#af69211493a22429ccc38ca8dcbdcd9c4">XorTree::XorTree</a></div><div class="ttdeci">XorTree(int n, int ssp=40)</div><div class="ttdef"><b>Definition:</b> xor_tree.h:14</div></div>
<div class="ttc" id="class_xor_tree_html_a3f669624bfe400630850716046096cfc"><div class="ttname"><a href="class_xor_tree.html#a3f669624bfe400630850716046096cfc">XorTree::circuit</a></div><div class="ttdeci">void circuit(block *out, block *in)</div><div class="ttdef"><b>Definition:</b> xor_tree.h:38</div></div>
<div class="ttc" id="utils_2block_8h_html_af2ad8a9f0015464df6574a13e598bdb8"><div class="ttname"><a href="utils_2block_8h.html#af2ad8a9f0015464df6574a13e598bdb8">zero_block</a></div><div class="ttdeci">#define zero_block()</div><div class="ttdef"><b>Definition:</b> block.h:66</div></div>
<div class="ttc" id="class_xor_tree_html_ae93134171f86f8610b48ab8eed01fa35"><div class="ttname"><a href="class_xor_tree.html#ae93134171f86f8610b48ab8eed01fa35">XorTree::gen</a></div><div class="ttdeci">void gen(bool *out, bool *in)</div><div class="ttdef"><b>Definition:</b> xor_tree.h:73</div></div>
<div class="ttc" id="class_xor_tree_html_a406396309c9b8f76b5706225aba1ae35"><div class="ttname"><a href="class_xor_tree.html#a406396309c9b8f76b5706225aba1ae35">XorTree::circuitN</a></div><div class="ttdeci">void circuitN(block *out, block *in, int dim=N)</div><div class="ttdef"><b>Definition:</b> xor_tree.h:26</div></div>
<div class="ttc" id="class_xor_tree_html"><div class="ttname"><a href="class_xor_tree.html">XorTree</a></div><div class="ttdef"><b>Definition:</b> xor_tree.h:10</div></div>
<div class="ttc" id="utils_2block_8h_html_a1a61c940fcdfab9d717ed2f9c27f3602"><div class="ttname"><a href="utils_2block_8h.html#a1a61c940fcdfab9d717ed2f9c27f3602">fix_key</a></div><div class="ttdeci">const char fix_key[]</div><div class="ttdef"><b>Definition:</b> block.h:130</div></div>
<div class="ttc" id="class_p_r_g_html"><div class="ttname"><a href="class_p_r_g.html">PRG</a></div><div class="ttdef"><b>Definition:</b> prg.h:16</div></div>
<div class="ttc" id="class_p_r_g_html_a3b64a0c91c31cec853c1829953409520"><div class="ttname"><a href="class_p_r_g.html#a3b64a0c91c31cec853c1829953409520">PRG::random_data</a></div><div class="ttdeci">void random_data(void *data, int nbytes)</div><div class="ttdef"><b>Definition:</b> prg.h:49</div></div>
<div class="ttc" id="class_xor_tree_html_a9ca6435f85c74f86584bfd24f8e30866"><div class="ttname"><a href="class_xor_tree.html#a9ca6435f85c74f86584bfd24f8e30866">XorTree::ssp</a></div><div class="ttdeci">int ssp</div><div class="ttdef"><b>Definition:</b> xor_tree.h:11</div></div>
<div class="ttc" id="class_xor_tree_html_adbec4bd5ec40bee293c71c69c50c3ebd"><div class="ttname"><a href="class_xor_tree.html#adbec4bd5ec40bee293c71c69c50c3ebd">XorTree::n</a></div><div class="ttdeci">int n</div><div class="ttdef"><b>Definition:</b> xor_tree.h:11</div></div>
<div class="ttc" id="utils_2block_8h_html_a82cb0a8d42708a807a061856813ac9f6"><div class="ttname"><a href="utils_2block_8h.html#a82cb0a8d42708a807a061856813ac9f6">one_block</a></div><div class="ttdeci">#define one_block()</div><div class="ttdef"><b>Definition:</b> block.h:67</div></div>
<div class="ttc" id="bit_8h_html"><div class="ttname"><a href="bit_8h.html">bit.h</a></div></div>
<div class="ttc" id="class_xor_tree_html_a09bb4de1c5f3eab9134248695cd90941"><div class="ttname"><a href="class_xor_tree.html#a09bb4de1c5f3eab9134248695cd90941">XorTree::output_size</a></div><div class="ttdeci">int output_size()</div><div class="ttdef"><b>Definition:</b> xor_tree.h:64</div></div>
<div class="ttc" id="utils_2block_8h_html_a26f0bc3cdba6ad8ab7e14bb989f74205"><div class="ttname"><a href="utils_2block_8h.html#a26f0bc3cdba6ad8ab7e14bb989f74205">andBlocks</a></div><div class="ttdeci">block andBlocks(block x, block y)</div><div class="ttdef"><b>Definition:</b> block.h:36</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_eec959d81771dc8b1a750b834e1341eb.html">emp-tool</a></li><li class="navelem"><a class="el" href="dir_363cbed62d1567d90b8cbb6bda69428f.html">utils</a></li><li class="navelem"><a class="el" href="xor__tree_8h.html">xor_tree.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.12 </li>
  </ul>
</div>
</body>
</html>
